SARTRE: System Overview A Case-Based Agent for Two-Player Texas Hold’em
نویسندگان
چکیده
SARTRE (Similarity Assessment Reasoning for Texas hold’em via Recall of Experience) is a heads-up (two-player) poker-bot that plays limit Texas Hold’em using the case-based reasoning methodology. This paper presents an overview of the SARTRE system. As far as we are aware SARTRE is the only poker-bot designed specifically to play heads-up Texas Hold’em using a CBR foundation. The design and implementation of the current system is discussed. Case features are illustrated and their reasons for selection are addressed. Finally, avenues for future areas of investigation are then listed.
منابع مشابه
A Memory-Based Approach to Two-Player Texas Hold'em
A Case-Based Reasoning system, nicknamed SARTRE, that uses a memory-based approach to play two-player, limit Texas Hold’em is introduced. SARTRE records hand histories from strong players and attempts to re-use this information to handle novel situations. SARTRE’S case features and their representations are described, followed by the results obtained when challenging a world-class computerised ...
متن کاملSimilarity-Based Retrieval and Solution Re-use Policies in the Game of Texas Hold'em
In previous papers we have presented our autonomous poker playing agent (SARTRE) that uses a memory-based approach to create a betting strategy for two-player, limit Texas Hold’em. SARTRE participated in the 2009 IJCAI Computer Poker Competition where the system was thoroughly evaluated by challenging a range of other computerised opponents. Since the competition SARTRE has undergone case-based...
متن کاملA Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation
We present a game theory-based heads-up Texas Hold’em poker player, GS1. To overcome the computational obstacles stemming from Texas Hold’em’s gigantic game tree, the player employs our automated abstraction techniques to reduce the complexity of the strategy computations. Texas Hold’em consists of four betting rounds. Our player solves a large linear program (offline) to compute strategies for...
متن کاملRegret Minimization in Non-Zero-Sum Games with Applications to Building Champion Multiplayer Computer Poker Agents
In two-player zero-sum games, if both players minimize their average external regret, then the average of the strategy profiles converges to a Nash equilibrium. For n-player general-sum games, however, theoretical guarantees for regret minimization are less understood. Nonetheless, Counterfactual Regret Minimization (CFR), a popular regret minimization algorithm for extensiveform games, has gen...
متن کاملUsing counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers). A deterministic game has no chance element and in a perfect information game, all information is visible to all players. However, many real-world scenarios with competing agents are stochastic (non-deterministic) with...
متن کامل